0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n138.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:59:23 CST 2018
0.00/0.21	% done 5 iterations in 0.007s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(cS_LEM1C_pme, conjecture,
0.00/0.21	  (((![X:(a > $o)]:
0.00/0.21	       (((![Xx0:a,Xy:a]: ((X(Xy) & X(Xx0)) => X(cP(Xx0,Xy)))) & X(cZ)) =>
0.00/0.21	        (![Xx0:a]: X(Xx0)))) & 
0.00/0.21	    (![Xx0:a,Xy:a,Xu:a,Xv:a]:
0.00/0.21	       ((cP(Xx0,Xu) = cP(Xy,Xv)) => ((Xu = Xv) & (Xx0 = Xy)))) & 
0.00/0.21	    (![Xx0:a,Xy:a]: (cP(Xx0,Xy) != cZ))) =>
0.00/0.21	   (![R:((a * a * a) > $o)]:
0.00/0.21	      ((![Xa:a,Xb:a,Xc:a]:
0.00/0.21	          (((?[Xx1:a,Xx2:a,Xy1:a,Xy2:a,Xz1:a,Xz2:a]:
0.00/0.21	               (R(Xx2,Xy2,Xz2) & R(Xx1,Xy1,Xz1) & (Xc = cP(Xz1,Xz2)) & 
0.00/0.21	                (Xb = cP(Xy1,Xy2)) & (Xa = cP(Xx1,Xx2)))) | 
0.00/0.21	            ((Xa = Xc) & (Xb = cZ)) | ((Xb = Xc) & (Xa = cZ))) =>
0.00/0.21	           R(Xa,Xb,Xc))) =>
0.00/0.21	       R(cZ,x,x))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (((![X:(a > $o)]:
0.00/0.21	         (((![Xx0:a,Xy:a]: ((X(Xy) & X(Xx0)) => X(cP(Xx0,Xy)))) & X(cZ)) =>
0.00/0.21	          (![Xx0:a]: X(Xx0)))) & 
0.00/0.21	      (![Xx0:a,Xy:a,Xu:a,Xv:a]:
0.00/0.21	         ((cP(Xx0,Xu) = cP(Xy,Xv)) => ((Xu = Xv) & (Xx0 = Xy)))) & 
0.00/0.21	      (![Xx0:a,Xy:a]: (cP(Xx0,Xy) != cZ))) =>
0.00/0.21	     (![R:((a * a * a) > $o)]:
0.00/0.21	        ((![Xa:a,Xb:a,Xc:a]:
0.00/0.21	            (((?[Xx1:a,Xx2:a,Xy1:a,Xy2:a,Xz1:a,Xz2:a]:
0.00/0.21	                 (R(Xx2,Xy2,Xz2) & R(Xx1,Xy1,Xz1) & (Xc = cP(Xz1,Xz2)) & 
0.00/0.21	                  (Xb = cP(Xy1,Xy2)) & (Xa = cP(Xx1,Xx2)))) | 
0.00/0.21	              ((Xa = Xc) & (Xb = cZ)) | ((Xb = Xc) & (Xa = cZ))) =>
0.00/0.21	             R(Xa,Xb,Xc))) =>
0.00/0.21	         R(cZ,x,x)))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X8 : a, X9 : a, X10 : a]: (sk_R(X8, X9, X10) | X9 != X10 | X8 != cZ),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('1', plain, ![X10 : a]: sk_R(cZ, X10, X10),
0.00/0.21	    inference('simplify', [status(thm)], ['0'])).
0.00/0.21	tff('2', plain, ~ sk_R(cZ, x, x),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('3', plain, ~ $true, inference('sup-', [status(thm)], ['1', '2'])).
0.00/0.21	tff('4', plain, $false, inference('simplify', [status(thm)], ['3'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
